Sparse Aitken–Schwarz domain decomposition with application to Darcy flow
نویسندگان
چکیده
This paper focuses on the acceleration of Schwarz method by Aitken’s convergence technique considering special structure Schwarz’s error operator between two consecutive iterates domain decomposition’s interfaces. The new proposed method, called Sparse Aitken-Schwarz builds a low-rank space for each subdomain to approximate true solution its interfaces instead building associated gathered subdomains’ as does. We show that resulting is better than full GMRES applied global interface problem generated whose dimension larger size Krylov same number local solving. has robustness noise Aitken-Schwarz. Weak and strong scaling results two-level parallel implementation improvements over 3D Darcy flow application with randomly distributed permeability fields high contrast values (Berenguer & Al, process using singular value decomposition heterogeneous groundwater problems, Computers Fluids 80:320-326, 2013). • Aitken–Schwarz improves respecting block analytical Restrictive Additive Schwarz’ operator. It allows build low–rank more rich those methods avoids accelerated introduced dense approximation RAS’ in leading robust solver. performs weak respect subdomains needing lower q + 1 successive traces. exhibits good performances field values.
منابع مشابه
Application of domain decomposition methods to indoor air flow simulation
A framework for solving the nonisothermal URANS equations with emphasis on applications to thermal building simulation is prescribed in this paper. Different domain decomposition techniques are used (i) for the treatment of boundary layers, (ii) for the efficient solution of the arising linear subproblems, and (iii) for coupling the indoor air flow field with the ambient. The approach is then a...
متن کاملRobin-Robin Domain Decomposition Methods for the Stokes-Darcy Coupling
In this paper we consider a coupled system made of the Stokes and Darcy equations, and we propose some iteration-by-subdomain methods based on Robin conditions on the interface. We prove the convergence of these algorithms, and for suitable finite element approximations we show that the rate of convergence is independent of the mesh size h. A special attention is paid to the optimization of the...
متن کاملDecomposition of sparse graphs, with application to game coloring number
Let k be a nonnegative integer, and let mk = 4(k+1)(k+3) k2+6k+6 . We prove that every simple graph with maximum average degree less than mk decomposes into a forest and a subgraph with maximum degree at most k. It follows that every simple graph with maximum average degree less than mk has game coloring number at most 4 + k.
متن کاملInterface control domain decomposition (ICDD) method for Stokes-Darcy coupling
We propose the ICDD method to solve the coupling between Stokes and Darcy equations. According to this approach, the problem is formulated as an optimal control problem whose control variables are the traces of the velocity and the pressure on the internal boundaries of the subdomains that provide an overlapping decomposition of the original computational domain. A theoretical analysis is carri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Fluids
سال: 2022
ISSN: ['0045-7930', '1879-0747']
DOI: https://doi.org/10.1016/j.compfluid.2022.105687